Definitions and results for Cryptosystems
نویسنده
چکیده
In a conventional or symmetric system, we always have ke = kd. Furthermore, there are two fixed finite sets given: P , the set of plaintexts and C, the set of ciphertexts. In most conventional systems, there is also a fixed set of keys K given, and G takes no inputs, but simply outputs a key chosen uniformly from K. Furthermore, it is often the case that P = C. For instance in Shift Cipher, or Caesar substitution on the English alphabet, we always have P = C = Z26. Moreover, a key is generated by choosing a random element from Z26.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملOn Finite Automaton One-Key Cryptosystems
This paper reviews some works on finite automaton one-key cryptosystems and related topics such as autonomous finite automata and Latin arrays. It is well known that shift registers are important sequence generators in stream ciphers. But shift registers are merely a special kind of autonomous finite automata. Finite automata were considered as suitable mathematical models of cryptosystems from...
متن کاملComparison of two Public Key Cryptosystems
Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...
متن کاملThe Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems
Abs t rac t . The notion of a Secretly Embedded Trapdoor with Universal Protection (SETUP) and its variations on attacking black-box cryptosysterns has been recently introduced. The basic definitions, issues, and examples of various setup attacks (called Kleptographic attacks) have also been presented. The goal of this work is to describe a methodological way of attacking cryptosystems which ex...
متن کاملOn the Security of Cryptosystems with All-or-Nothing Transform
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output, it is easy to retrieve the message. On the other hand, if sufficiently many bits of the output are missing, it is computationally infeasible for an polynomial-time adversary to learn any information about the message...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004